Visual Odometry for Non-overlapping Views Using Second-Order Cone Programming
نویسندگان
چکیده
We present a solution for motion estimation for a set of cameras which are firmly mounted on a head unit and do not have overlapping views in each image. This problem relates to ego-motion estimation of multiple cameras, or visual odometry. We reduce motion estimation to solving a triangulation problem, which finds a point in space from multiple views. The optimal solution of the triangulation problem in Linfinity norm is found using SOCP (Second-Order Cone Programming) Consequently, with the help of the optimal solution for the triangulation, we can solve visual odometry by using SOCP as well.
منابع مشابه
Waveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کاملExtrinsic self-calibration of multiple cameras with non-overlapping views in vehicles
Due to decreasing sensor prices and increasing processing performance, the use of multiple cameras in vehicles becomes an attractive possibility for environment perception. This contribution focuses on non-overlapping multi-camera configurations on a mobile platform and their purely vision-based self-calibration as well as their restrictions. The usage of corresponding features between the came...
متن کاملSolving A Fractional Program with Second Order Cone Constraint
We consider a fractional program with both linear and quadratic equation in numerator and denominator having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a second order cone programming (SOCP) problem. For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملPeople Re-identification in Non-overlapping Field-of-views using Cumulative Brightness Transform Function and Body Segments in Different Color Spaces
Non-overlapping field-of-view (FOV) cameras are used in surveillance system to cover a wider area. Tracking in such systems is generally performed in two distinct steps. In the first step, people are identified and tracked in the FOV of a single camera. In the second step, re-identification of the people is carried out to track them in the whole area under surveillance. Various conventional fea...
متن کامل